منابع مشابه
Linear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملLinear Logic complements Classical Logic
Classical logic enforces the separation of individuals and predicates, linear logic draws them together via interaction; these are not right-orwrong alternatives but dual or complementary logics. Linear logic is an incomplete realization of this duality. While its completion is not essential for the development and maintenance of logic, it is crucial for its application. We outline the “four-sq...
متن کاملLinear Logic
Material for the course Lineare Logik mit Anwendungen, Technische Hochschule Darmstadt, Sommersemester 1996. Revised for the course Linear Logic at Carnegie Mellon University, Spring 1998, Fall 2001. Material for this course is available at http://www.cs.cmu.edu/~fp/courses/linear.html. Please send comments to [email protected] This material is in rough draft form and is likely to contain errors. F...
متن کاملSimulating Linear Logic in 1-Only Linear Logic
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. It turned out that full propositional Linear Logic is undecidable (Lincoln, Mitchell, Scedrov, and Shankar) and, hence, it is more expressive than (modalized) classical or intuitionistic logic. In this paper we focus on the study of the simplest fragments of Linear Logic, such as the one-literal and con...
متن کاملLinear Temporal Logic and Linear Dynamic Logic on Finite Traces
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf , i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf interpreted over finite traces. Indeed, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90045-4